A combinatorial interpretation of the recurrence fn+1 = 6fn − fn−1
نویسندگان
چکیده
منابع مشابه
A combinatorial interpretation of the recurrence fn+1 = 6fn - fn-1
Bonin et al. (1993) recalled an open problem related to the recurrence relation verified by NSW numbers. The recurrence relation is the following: fn+l = 6f~ f~l , with jq = 1 and j~ = 7, and no combinatorial interpretation seems to be known. In this note, we define a regular language .~ whose number of words having length n is equal to f~+l. Then, by using .La we give a direct combinatorial pr...
متن کاملRecurrent Ischemia After Thrombolysis: Importance of Associated Clinical Findings fn1
Objectives. We sought to assess the incidence and clinical relevance of examination data to recurrent ischemia within an international randomized trial. Background. Ischemic symptoms commonly recur after thrombolysis for acute myocardial infarction. Methods. Patients (n 5 40,848) were prospectively evaluated for recurrent angina and transient electrocardiographic (ECG) or hemodynamic changes. F...
متن کاملOperator Volume and Outcomes in 12,988 Percutaneous Coronary Interventions fn1
PAUL D. MCGRATH, MD, MSC,* DAVID E. WENNBERG, MD, MPH,*† DAVID J. MALENKA, MD, FACC,† MIRLE A. KELLETT, JR., MD, FACC,* THOMAS J. RYAN, JR., MD, FACC,* JOHN R. O’MEARA, MD, FACC,* WILLIAM A. BRADLEY, MD, FACC,‡ MICHAEL J. HEARNE, MD, FACC,§ BRUCE HETTLEMAN, MD, FACC,† JOHN F. ROBB, MD, FACC,† SAMUEL SHUBROOKS, MD, FACC,\ PETER VERLEE, MD, FACC,¶ MATTHEW W. WATKINS, MD, FACC,# FRANCIS L. LUCAS, ...
متن کاملA Combinatorial Interpretation for a Super-Catalan Recurrence
Nicholas Pippenger and Kristin Schleich have recently given a combinatorial interpretation for the second-order super-Catalan numbers (un)n 0 = (3; 2; 3; 6; 14; 36; :::): they count \aligned cubic trees" on n internal vertices. Here we give a combinatorial interpretation of the recurrence un = Pn=2 1 k=0 n 2 2k 2 2 uk : it counts these trees by number of deep interior vertices where deep interi...
متن کاملCombinatorial interpretation of the recurrence relation for fibonomial coefficients
A classical-like combinatorial interpretation of the Fibonomial coefficients is provided following [1,2]. An adequate combinatorial interpretation of recurrence satisfied by Fibonomial coefficients is also proposed. It is considered to be in the spirit classicalcombinatorial interpretation like binomial Newton and Gauss q-binomial coefficients or Stirling number of both kinds are. (See ref. [3,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)80008-3